On the shape of a set of points and lines in the plane
نویسندگان
چکیده
Detailed geometric models of the real world are in increasing demand. LiDAR data is appropriate to reconstruct such models. For urban reconstruction, it works well to reconstruct the individual surfaces of the scene and connect them to form the scene geometry. There are various methods for reconstructing the free-form shape of a point sample on a single surface. However, these methods do not take the context of the surface into account. We present the generalized and guided α-shape: two extensions of the well known α-shape. The generalized α-shape handles lines (generalized points) as if they are infinite collections of points. The guided α-shape handles lines (guides) as indicators for preferred locations for the boundary of the shape. The guided α-shape uses (parts of) these lines as boundary where the points suggest that this is appropriate. We prove that, for an input of n points and m guides, both the generalized and guided α-shape can be constructed in O((n + m) log(n + m)) time. We apply guided α-shapes to urban reconstruction from LiDAR, where neighboring surfaces can be connected conveniently along their intersection lines into adjacent surfaces of a 3D model. We analyze guided α-shapes of both synthetic and real data and show they are consistently better than α-shapes for this application.
منابع مشابه
TOPOLOGY OPTIMIZATION OF PLANE STRUCTURES USING BINARY LEVEL SET METHOD AND ISOGEOMETRIC ANALYSIS
This paper presents the topology optimization of plane structures using a binary level set (BLS) approach and isogeometric analysis (IGA). In the standard level set method, the domain boundary is descripted as an isocountour of a scalar function of a higher dimensionality. The evolution of this boundary is governed by Hamilton–Jacobi equation. In the BLS method, the interfaces of subdomai...
متن کاملبازیابی مبتنی بر شکل اجسام با توصیفگرهای بدست آمده از فرآیند رشد کانتوری
In this paper, a novel shape descriptor for shape-based object retrieval is proposed. A growing process is introduced in which a contour is reconstructed from the bounding circle of the shape. In this growing process, circle points move toward the shape in normal direction until they get to the shape contour. Three different shape descriptors are extracted from this process: the first descript...
متن کاملON THE STRUCTURE OF FINITE PSEUDO- COMPLEMENTS OF QUADRILATERALS AND THEIR EMBEDDABILITY
A pseudo-complement of a quadrilateral D of order n, n, > 3, is a non-trivial (n+l)- regular linear space with n - 3n + 3 points and n + n - 3 lines. We prove that if n > 18 and D has at least one line of size n - 1, or if n > 25 , then the set of lines of D consists of three lines of size n -1, 6(n - 2) lines of size n - 2, and n - 5n + 6 lines of size n - 3. Furthermore, if n > 21 and D...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملEffects of CT and VT Connection Point on Distance Protection of Transmission Lines with FACTS Devices
This paper presents the effects of instrument transformers connection points on the measured impedance by distance relays in the presence of Flexible Alternating Current Transmission System (FACTS) devices with series connected branch. Distance relay tripping characteristic itself depends on the power system structural conditions, pre-fault operational conditions, and especially the ground ...
متن کاملآشکارسازی حالات لبخند و خنده چهره افراد بر پایه نقاط کلیدی محلی کمینه
In this paper, a smile and laugh facial expression is presented based on dimension reduction and description process of the key points. The paper has two main objectives; the first is to extract the local critical points in terms of their apparent features, and the second is to reduce the system’s dependence on training inputs. To achieve these objectives, three different scenarios on extractin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 30 شماره
صفحات -
تاریخ انتشار 2011